12 research outputs found

    Admission Control Scheme for Effective Revenue Management in NGN Networks

    No full text
    Current paper presents some issues on impact of adjusting the proposed Aggregated Session Admission Control (AggSessAC) algorithm to its overall effectiveness and performance. The main objective of AggSessAC is to maximize total revenue from network serving demands. This method provides the possibility of selective and mutually comparative admission control at the cost of acceptable momentary waiting time delay, which is induced while all new aggregating demands are captured into the bundle. The simulations studies are implemented by using OMNeT++. Multiple simulation scenarios were performed to get a better understanding of the performance characteristics of the applied solution

    Analysis of effective fuzzy-CAC solution for proactive traffic engineering

    No full text
    Actual Connection Admission Control (CAC) implementation inside the RSVP-TE protocol in MPLS-TE networks is highly limited, since the applied threshold CAC cannot provide Quality of Service (QoS) aware decision making on MPLS-TE network nodes. This prevents an effective end-to-end QoS control in a fully dynamic, application driven Label Switched Path (LSP) setup scenario. Authors of this paper have developed effective and flexible Fuzzy logic driven CAC solution (Fuzzy-CAC) which is capable of sustaining the parameters of QoS within the accepted limits and provide the dynamic setup of an application-controlled LSP. In this paper we present basic results as well as more in details discuss several adaptation approaches that help Fuzzy-CAC to operate under rapidly changing traffic characteristics

    Evaluation of AggSessAC Admission Control Solution to Improve Network Revenue

    No full text
    The evaluation of a new admission control scheme that provides selective and priority-based flow admission strategy is an essential part of network revenue management in order to provide their maximization. The existing CAC schemes largely based on the serialized processing strategy of new requests, while making an acceptance or rejection decision once a new request arrives. However, present traffic volumes and computing capabilities allows us to offer a new admission control. The proposed method focuses on a new operation paradigm for admission control scheme, where requests are aggregated and processed using mutually comparisons among them, thus facilitating selectivity and network revenue maximization. We publish method architecture and realization description in modular OMNeT++ simulation environment as well as the obtained results. Finally, simulation results of proposed scheme are compared with conventional ThresholdAC method, which uses available link bandwidth for decision-making process and serialized flow processing strategy. The results show that the proposed method greatly improves and extends decision-making process and allows increasing number of accepted higher priority traffic flows and, as a result, the network revenues

    Fair Bandwidth Sharing Scheme based on Upload Traffic Control

    No full text
    The current paper presents the evaluation of new fair downstream bandwidth sharing strategy and effective shared link utilization for TCP/IP networks. The proposed method provides download bandwidth fair sharing among multiple data flows based on their upload per-flow rate limitation. We evaluate the current approach by controlling upload rate to obtain fair download bandwidth sharing for each of the flows in the link. The performance of the proposed method is evaluated on physical test network. The experimental results demonstrate that our approach can successfully provide fair bandwidth distribution among multiple data flows and can be promising method for bandwidth management in the real data networks

    Fuzzy-CAC based Traffic Management in MPLS-TE Networks

    No full text
    Actual Connection Admission Control (CAC) realization inside the resource reservation protocol – traffic engineering extension (RSVP-TE) in Multiprotocol Label Switching (MPLS-TE) networks does not provide the ability of effective decision making. The actual threshold CAC lacks the capability of taking into the consideration possible application QoS requirements and network QoS potentialities. This makes the impossible to effectively control end-to-end QoS in a fully dynamic, application driven Label Switched Path (LSP) setup scenario. Instant paper presents the results of the practical MPLS-TE realization, with fuzzy-CAC driven RSVP-TE agent. Fuzzy- CAC is applied to a testbed where a client application requests a real-time data transfer through the MPLS-TE test network, which results in selective LSP setup. The differentiated traffic flow treatment is realized while using IF-THEN knowledge rule base. The results for best and worst case scenarios are presented

    Practical Fuzzy-CAC Realization for Effective Traffic Engineering in MPLS-TE Networks

    No full text
    In this investigation the new Fuzzy-CAC algorithm practical implementation of RSVP-TE protocol development for use in MPLSTE/ GMPLS networks is presented. Fuzzy-CAC algorithm is tested on the MPLS-TE network testbed with 3 Cisco 2800 series routers, on which classical threshold CAC algorithm is compared to the Fuzzy-CAC algorithm implementation. Main QoS characteristics are analyzed, experimental data are depicted and future research subjects are described

    Testing the Null Hypothesis of Stationarity of Internet Traffic

    No full text
    The statistical analyses indicate that the measured traffic traces from the packet networks often contain non-stationary effects. In these cases several popular tests for long-range dependence and/or stationarity can result in wrong conclusions and unreliable estimate of the Hurst parameter. In this paper non-stationarities are modeled as the trends and/or level shifts in Internet traffic data. MMPP-Based Hierarchical Model simulation data are used for stationarity tests. Application of testing results are integrated into network resource allocation function as a Partially Observable Markov Decision process

    Evaluation of Selective Aggregated Session CAC for QoS Provisioning in All-Optical Networks

    No full text
    All-optical WDM networks with dynamic Virtual Network Topology (VNT) control can provide effective ligthpaths-resources allocation for Next Generation Networks (NGN). However VNT can not fully provide adequate Quality of Service (QoS) as VNT control methods are not able to allocate additional resources, when problem can not be solved with the ligthpath recombination. In this paper we propose a specific selective connection admission control (CAC) algorithm AggSessAC (Aggregated Session Admission Control) for NGN networks. It provides effective traffic management while maximizing the number of accepted flows of most prior traffic class under the overutilized conditions. Performance of the proposed AggSessAC algorithm is experimentally evaluated as well as compared in simulation testbed using a traditional threshold based admission control as a benchmark. The computational simulation numerical results show promising improvement in traffic management evaluated in terms of the total revenue of serving demand

    Comprehensive Analysis of AggSessAC Method for Revenue Maximization Using OMNeT++

    No full text
    The growing demand for Internet connection of various devices with an ability to provide smarter online services and the rapid growth of mobile applications significantly increases the number of processed data flows. All the generated flows require selective and priority-based flow admission strategy. Network operators are interested in effective utilization of their infrastructure as well as in minimizing rejection probability of higher priority flows while maximizing their revenue, especially in peak hours. The existing connection admission control (CAC) schemes are largely based on serialized processing strategies of new flows without any comparison among consequent requests. However, evolution of Internet and present performance capabilities of routers allows us to offer a new approach for admission control – our developed Aggregated Session Admission Control (AggSessAC). We propose to handle service requests using a new operation paradigm of CAC, where requests are temporarily collected and processed using mutually comparisons among them, thus facilitating selectivity and ensuring network revenue maximization as well as operator gain. In order to evaluate the proposed algorithm, OMNeT++ simulation platform with the INET Framework was used and a new output queue of router has been developed including all relevant entities of proposed admission control. Simulation results are compared with conventional threshold admission control method, which only uses available link bandwidth for decision-making process and serialized flow processing strategy. The proposed method shows that selective and comparative flow control allows maximizing the number of accepted higher priority flows and is able to significantly increase the total network revenues in peak hours, compared to the standard threshold based approach. We assume that AggSessAC can be effectively used as the potential admission control mechanism in Next Generation Networks (NGN)

    Selective Aggregated Session Control with QoS Provisioning for GMPLS Networks

    No full text
    In this investigation the new AggSess admission control (AC) algorithm is presented for use in GMPLS networks. AggSess AC algorithm is tested on simulated network model, on which classical threshold AC algorithm is compared to the AggSess AC implementation. Main QoS characteristics are analyzed, experimental data are depicted and future research subjects are described
    corecore